Using edge contractions to reduce the semitotal domination number
نویسندگان
چکیده
In this paper, we consider the problem of reducing semitotal domination number a given graph by contracting k edges, for some fixed k≥1. We show that can always be done with at most 3 edge contractions and further characterise those graphs requiring 1, 2 or contractions, respectively, to decrease their number. then study complexity k=1 obtain in particular complete dichotomy monogenic classes.
منابع مشابه
Edge 2-rainbow domination number and annihilation number in trees
A edge 2-rainbow dominating function (E2RDF) of a graph G is a function f from the edge set E(G) to the set of all subsets of the set {1,2} such that for any edge.......................
متن کاملAlgorithmic Aspects of Semitotal Domination in Graphs
For a graph G = (V,E), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a semitotal dominating set of minimum cardinality. Given a graph G and a positive integer k, the Semitotal Domination Decision problem is to decide whether G has a semito...
متن کاملThe edge domination number of connected graphs
A subset X of edges in a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X. The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. Let m,n and k be positive integers with n − 1 ≤ m ≤ (n 2 ) , G(m,n) be the set of all non-isomorphic connected graphs of order n and size m, and G(m,n; k) = {G ∈ G(m...
متن کاملOn trees with total domination number equal to edge-vertex domination number plus one
An edge e ∈ E(G) dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is edgevertex dominated by an edge of D. The edge-vertex domination number of a graph G is the minimum cardinality of an edge-vertex dominating set of G. A subset D ⊆ V (G) is a total d...
متن کاملEdge Roman Star Domination Number on Graphs
Edge Roman Star Domination Number on Graphs Angshu Kumar Sinha, Akul Rana and Anita Pal Department of Mathematics, NSHM Knowledge Campus Durgapur -713212, INDIA. e-mail: [email protected] Department of Mathematics, Narajole Raj College Narajole, Paschim Medinipur721211, INDIA. e-mail: [email protected] Department of Mathematics, National Institute of Technology Durgapur Durgapur-713209, I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.10.020